package main;

import java.util.ArrayList;
import java.util.List;

import DataStructures.ChapterThreeExercise;

public class Test {

	public static void main(String[] args) {
		List<Integer> L = new ArrayList<Integer>();
		List<Integer> P = new ArrayList<Integer>();
		for(int i = 0; i < 30; i += 2)
			P.add(i);
		for(int i = 0; i < 30; i += 3)
			L.add(i);
//		System.out.println("L = " + L);
//		System.out.println("P = " + P);
		//3.1
//		ChapterThreeExercise.printLots(L, P);
		//3.5
//		System.out.println("L U P = " + ChapterThreeExercise.ListUnion(L, P));
		//3.4
//		System.out.println("L N P = " + ChapterThreeExercise.ListN(L, P));
		//3.6
//		System.out.println("order = " + ChapterThreeExercise.josephusProblem(1, 5));
		//3.21
//		System.out.println(ChapterThreeExercise.balanceSigned("wangfsffd))fdgg"));
//		System.out.println(ChapterThreeExercise.balanceSignedWithMore("{[(1+2)-4]} */"));
		//3.22
//		System.out.println(ChapterThreeExercise.postfixCompute("6523+8*+3+*"));
		//3.23
		System.out.println(ChapterThreeExercise.infixToPostfix("3+5*(4+6)"));
		
	}

}
